Quick Detection of Top-k Personalized PageRank Lists
نویسندگان
چکیده
We study a problem of quick detection of top-k Personalized PageRank (PPR) lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and person name disambiguation. We argue that two observations are important when finding top-k PPR lists. Firstly, it is crucial that we detect fast the top-k most important neighbors of a node, while the exact order in the top-k list and the exact values of PPR are by far not so crucial. Secondly, by allowing a small number of “wrong” elements in top-k lists, we achieve great computational savings, in fact, without degrading the quality of the results. Based on these ideas, we propose Monte Carlo methods for quick detection of top-k PPR lists. We demonstrate the effectiveness of these methods on the Web and Wikipedia graphs, provide performance evaluation and supply stopping criteria.
منابع مشابه
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and name disambiguation. In particular, we apply our results to construct efficient algorithms for the person name disambiguation problem. We argue that when finding top-k Personalized PageRa...
متن کاملAn Application of Personalized PageRank Vectors: Personalized Search Engine
We introduce a tool which is an application of personalized pagerank vectors such as personalized search engines. We use pre-computed pagerank vectors to rank the search results in favor of user preferences. We describe the design and architecture of our tool. By using pre-computed personalized pagerank vectors we generate search results biased to user preferences such as top-level domain and r...
متن کاملFast Algorithm for Top-k Personalized PageRank Queries with Layered Graphs
In recent years, an efficient method of performing analyses and computations on graph networks, regarding recent and up-to-date data, has been needed due to continuous growth of datasets. Personalized PageRank is one of the most well-known computation methods for graphs. Personalized PageRank computes the relative importance or relevance with respect to a set of given nodes, called start nodes ...
متن کاملHubPPR: Effective Indexing for Approximate Personalized PageRank
Personalized PageRank (PPR) computation is a fundamental operation in web search, social networks, and graph analysis. Given a graphG, a source s, and a target t, the PPR query π(s, t) returns the probability that a random walk on G starting from s terminates at t. Unlike global PageRank which can be effectively pre-computed and materialized, the PPR result depends on both the source and the ta...
متن کاملPersonalized Recommendation of Twitter Lists using Content and Network Information
Lists in social networks have become popular tools to organize content. This paper proposes a novel framework for recommending lists to users by combining several features that jointly capture their personal interests. Our contribution is of two-fold. First, we develop a ListRec model that leverages the dynamically varying tweet content, the network of twitterers and the popularity of lists to ...
متن کامل